Canard cycles in generic fast-slow systems on the torus

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Canard cycles in Global Dynamics

Fast-slow systems are studied usually by “geometrical dissection” [4]. The fast dynamics exhibit attractors which may bifurcate under the influence of the slow dynamics which is seen as a parameter of the fast dynamics. A generic solution comes close to a connected component of the stable invariant sets of the fast dynamics. As the slow dynamics evolves, this attractor may lose its stability an...

متن کامل

The Duck and the Devil: Canards on the Staircase

Slow-fast systems on the two-torus T 2 provide new effects not observed for systems on the plane. Namely, there exist families without auxiliary parameters that have attracting canard cycles for arbitrary small values of the time scaling parameter ε. In order to demonstrate the new effect, we have chosen a particularly simple family, namely ẋ = a − cosx − cos y, ẏ = ε, a ∈ (1, 2) being fixed. T...

متن کامل

Canard Solutions at Non-generic Turning Points

This paper deals with singular perturbation problems for vector fields on 2-dimensional manifolds. “Canard solutions” are solutions that, starting near an attracting normally hyperbolic branch of the singular curve, cross a “turning point” and follow for a while a normally repelling branch of the singular curve. Following the geometric ideas developed by Dumortier and Roussarie in 1996 for the ...

متن کامل

Economical Elimination of Cycles in the Torus

Let m > 2 be an integer, let C2m denote the cycle of length 2m on the set of vertices [−m,m) = {−m,−m+ 1, . . . ,m− 2,m− 1}, and let G = G(m, d) denote the graph on the set of vertices [−m,m), in which two vertices are adjacent iff they are adjacent in one coordinate of C2m and equal in all others. This graph can be viewed as the graph of the d-dimensional torus. We prove that one can delete a ...

متن کامل

Hamiltonian cycles in bipartite quadrangulations on the torus

In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple closed curve visiting each face and each vertex of G exactly once but crossing no edge. As an application, we conclude that the radial graph of any bipartite quadrangulation on the torus has a hamiltonian cycle.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the Moscow Mathematical Society

سال: 2010

ISSN: 0077-1554

DOI: 10.1090/s0077-1554-2010-00184-7